Isomorphisms of Algebraic Number Fields par

نویسندگان

  • Mark van Hoeij
  • Vivek Pal
چکیده

Let Q(α) and Q(β) be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, Q(β) → Q(α). The algorithm is particularly efficient if there is only one isomorphism.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isomorphisms of Algebraic Number Fields

Let Q(α) and Q(β) be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, Q(β) → Q(α). The algorithm is particularly efficient if there is only one isomorphism.

متن کامل

An Algorithm for Computing Isomorphisms of Algebraic Function Fields

We develop an algorithm for computing isomorphisms and automorphisms of algebraic function fields of transcendence degree one in characteristic zero and positive characteristic.

متن کامل

Topics in computational algebraic number theory par

We describe practical algorithms from computational algebraic number theory, with applications to class field theory. These include basic arithmetic, approximation and uniformizers, discrete logarithms and computation of class fields. All algorithms have been implemented in the Pari/Gp system.

متن کامل

Modified Proof of a Local Analogue of the Grothendieck Conjecture

A local analogue of the Grothendieck Conjecture is an equivalence of the category of complete discrete valuation fields K with finite residue fields of characteristic p 6= 0 and the category of absolute Galois groups of fields K together with their ramification filtrations. The case of characteristic 0 fields K was considered by Mochizuki several years ago. Then the author proved it by differen...

متن کامل

Cryptography based on number fields with large regulator par

We explain a variant of the Fiat-Shamir identification and signature protocol that is based on the intractability of computing generators of principal ideals in algebraic number fields. We also show how to use the Cohen-Lenstra-Martinet heuristics for class groups to construct number fields in which computing generators of principal ideals is intractable.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012